Computational error bounds for multiple or nearly multiple eigenvalues
نویسندگان
چکیده
منابع مشابه
Computational Error Bounds for Multiple or Nearly Multiple Eigenvalues
In this paper bounds for clusters of eigenvalues of non-selfadjoint matrices are investigated. We describe a method for the computation of rigorous error bounds for multiple or nearly multiple eigenvalues, and for a basis of the corresponding invariant subspaces. The input matrix may be real or complex, dense or sparse. The method is based on a quadratically convergent Newton-like method; it in...
متن کاملA Posteriori Error Analysis for Nonconforming Approximation of Multiple Eigenvalues
In this paper we study an a posteriori error indicator introduced in E. Dari, R.G. Durán, C. Padra, Appl. Numer. Math., 2012, for the approximation of Laplace eigenvalue problem with Crouzeix–Raviart non-conforming finite elements. In particular, we show that the estimator is robust also in presence of eigenvalues of multiplicity greater than one. Some numerical examples confirm the theory and ...
متن کاملMultiple Eigenvalues
The dimensions of sets of matrices of various types, with specified eigenvalue multiplicities, are determined. The dimensions of the sets of matrices with given Jordan form and with given singular value multiplicities are also found. Each corresponding codimension is the number of conditions which a matrix of the given type must satisfy in order to have the specified multiplicities.
متن کاملEfficient Methods for Multiple Sequence Alignment with Guaranteed Error Bounds
Multiple string (sequence) alignment is a difficult and important problem in computational biology, where it is central in two related tasks: finding highly conserved subregions or embedded patterns of a set of biological sequences (strings of DNA, RNA or amino acids), and inferring the evolutionary history of a set of taxa from their associated biological sequences. Several precise measures ha...
متن کاملAccurate Error Bounds for the Eigenvalues of the Kernel Matrix
The eigenvalues of the kernel matrix play an important role in a number of kernel methods, in particular, in kernel principal component analysis. It is well known that the eigenvalues of the kernel matrix converge as the number of samples tends to infinity. We derive probabilistic finite sample size bounds on the approximation error of individual eigenvalues which have the important property th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2001
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(00)00279-2